Assembly planning by disjunctive programming and geometrical reasoning

The challenge in modeling and solving assembly planning problems lies integrating combinatorial optimization techniques for finding efficient task sequences resource assignments with geometrical reasoning to ensure the technological feasibility of plans. This paper proposes a Benders decomposition approach that separates macro-level problem, responsible sequencing assignment, from micro-level validation on detailed models. Feedback micro macro level is provided form disjunctive constraints generated during search, which precludes repeated occurrence collisions encountered earlier iterations. A programming proposed solve problem added constraints. efficiency demonstrated both industrial case studies computational experiments instances. • mathematical formulation problem. based approach, where cuts are method generating by analyzing static dynamic geometric Computational results tests cases as well our benchmark data.